Upper and Lower Bounds on Gravitational Entropy
نویسندگان
چکیده
The gravitational entropy of the Universe is large and subtle to calculate. A lower bound is well known from supermassive black holes at the centers of galaxies, but the remainder is harder to pin down. A parametric model of clumped matter entropy is provided. We suggest a new upper bound due to dark matter halos, that is far below the holographic bound, yet above that for the supermassive black holes. [email protected] [email protected]
منابع مشابه
A note on inequalities for Tsallis relative operator entropy
In this short note, we present some inequalities for relative operator entropy which are generalizations of some results obtained by Zou [Operator inequalities associated with Tsallis relative operator entropy, {em Math. Inequal. Appl.} {18} (2015), no. 2, 401--406]. Meanwhile, we also show some new lower and upper bounds for relative operator entropy and Tsallis relative o...
متن کاملUpper and lower bounds of symmetric division deg index
Symmetric Division Deg index is one of the 148 discrete Adriatic indices that showed good predictive properties on the testing sets provided by International Academy of Mathematical Chemistry. Symmetric Division Deg index is defined by $$ SDD(G) = sumE left( frac{min{d_u,d_v}}{max{d_u,d_v}} + frac{max{d_u,d_v}}{min{d_u,d_v}} right), $$ where $d_i$ is the degree of vertex $i$ in graph $G$. In th...
متن کاملAnalytical Bounds between Entropy and Error Probability in Binary Classifications
The existing upper and lower bounds between entropy and error probability are mostly derived from the inequality of the entropy relations, which could introduce approximations into the analysis. We derive analytical bounds based on the closed-form solutions of conditional entropy without involving any approximation. Two basic types of classification errors are investigated in the context of bin...
متن کاملEstimating Upper and Lower Bounds For Industry Efficiency With Unknown Technology
With a brief review of the studies on the industry in Data Envelopment Analysis (DEA) framework, the present paper proposes inner and outer technologies when only some basic information is available about the technology. Furthermore, applying Linear Programming techniques, it also determines lower and upper bounds for directional distance function (DDF) measure, overall and allocative efficienc...
متن کاملQuantum Collision-Resistance of Non-uniformly Distributed Functions: Upper and Lower Bounds
We study the quantum query complexity of finding a collision for a function f whose outputs are chosen according to a non-uniform distribution D. We derive some upper bounds and lower bounds depending on the min-entropy and the collision-entropy of D. In particular, we improve the previous lower bound in [TTU16] from Ω(2) to Ω(2) where k is the min-entropy of D.
متن کامل